Convergence of GENET Guided Local Search for Constraint Satisfaction Problems
نویسندگان
چکیده
منابع مشابه
A Family of Stochastic Methods For Constraint Satisfaction and Optimisation
Constraint satisfaction and optimisation is NP-complete by nature. The combinatorial explosion problem prevents complete constraint programming methods from solving many real-life constraint problems. In many situations, stochastic search methods, many of which sacrifice completeness for efficiency, are needed. This paper reports a family of stochastic algorithms for constraint satisfaction and...
متن کاملA Lagrangian reconstruction of a class of local search methods
Heuristic repair algorithms, a class of local search methods, demonstrate impressive eeciency in solving some large-scale and hard instances of constraint satisfaction problems (CSP's). In this paper, we draw a surprising connection between heuristic repair techniques and the discrete Lagrange multiplier methods by transforming CSP's into zero-one constrained optimization problems. A Lagrangian...
متن کاملPii: S0004-3702(00)00053-9
GENET is a heuristic repair algorithm which demonstrates impressive efficiency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this paper, we draw a surprising connection between GENET and discrete Lagrange multiplier methods. Based on the work of Wah and Shang, we propose a discrete Lagrangian-based search scheme LSDL, defining a class of search al...
متن کاملExtending GENET with lazy arc consistency
Constraint satisfaction problems (CSP's) naturally occur in a number of important industrial applications, such as planning, scheduling and resource allocation. GENET is a neural network simulator to solve binary constraint satisfaction problems. GENET uses a convergence procedure based on a relaxed form of local consistency to nd assignments which are locally minimal in terms of constraint vio...
متن کاملGENET and Tabu Search for Combinatorial Optimization Problems
Constraint satisfaction problems are combinatorial optimization problems which involve finding an assignment to a set of variables that is consistent with a set of constraints. In this paper the use of two local search techniques, namely GENET and Tabu Search for constraint satisfaction optimization problems and partial constraint satisfaction problems is investigated. These methods are compare...
متن کامل